Distinct Distance Estimates and Low Degree Polynomial Partitioning
نویسندگان
چکیده
منابع مشابه
Distinct Distance Estimates and Low Degree Polynomial Partitioning
We give a shorter proof of a slightly weaker version of a theorem fromGuth and Katz (Ann Math 181:155–190, 2015): we prove that if L is a set of L lines in R3 with at most L1/2 lines in any low degree algebraic surface, then the number of r -rich points of L is L(3/2)+εr−2. This result is one of the main ingredients in the proof of the distinct distance estimate in Guth and Katz (2015). With ou...
متن کاملLow-Degree Polynomial Roots
5 Cubic Polynomials 7 5.1 Real Roots of Multiplicity Larger Than One . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 5.2 One Simple Real Root . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.3 Three Simple Real Roots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.4 A Mixed-Type Implementation . . . . . . . . . . . . ....
متن کاملChapter 4: Constant-degree Polynomial Partitioning
To see the issues that arise when studying incidence problems in higher dimensions, we consider one of the simplest cases: Incidences between m points and n planes in R. To see that this problem is not interesting, we consider the following point-plane configuration. Let l ⊂ R be a line, let P be a set of m points on l, and let H be a set of n planes that contain l (e.g., see Figure 1). This co...
متن کاملOrthogonal Polynomial Density Estimates: Alternative Representation and Degree Selection
The density estimates considered in this paper comprise a base density and an adjustment component consisting of a linear combination of orthogonal polynomials. It is shown that, in the context of density approximation, the coefficients of the linear combination can be determined either from a moment-matching technique or a weighted least-squares approach. A kernel representation of the corresp...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2014
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-014-9648-8